SDP Gaps for 2-to-1 and Other Label-Cover Variants
نویسندگان
چکیده
In this paper we present semidefinite programming (SDP) gap instances for the following variants of the Label-Cover problem, closely related to the Unique Games Conjecture: (i) 2-to-1 Label-Cover; (ii) 2-to-2 Label-Cover; (iii) α-constraint Label-Cover. All of our gap instances have perfect SDP solutions. For alphabet size K, the integral optimal solutions have value: (i) O(1/ √ logK); (ii) O(1/ logK); (iii) O(1/ √ logK). Prior to this work, there were no known SDP gap instances for any of these problems with perfect SDP value and integral optimum tending to 0.
منابع مشابه
Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy
Linear and semidefinite programming are highly successful approaches for obtaining good approximations for NP-hard optimization problems. For example, breakthrough approximation algorithms for Max Cut and Sparsest Cut use semidefinite programming. Perhaps the most prominent NP-hard problem whose exact approximation factor is still unresolved is Vertex Cover. Probabilistically checkable proof (P...
متن کاملIntegrality gaps of 2 − o(1) for Vertex Cover SDPs in the Lovász-Schrijver hierarchy
Linear and semidefinite programming are highly successful approaches for obtaining good approximations for NP-hard optimization problems. For example, breakthrough approximation algorithms for MAX CUT and SPARSEST CUT use semidefinite programming. Perhaps the most prominent NP-hard problem whose exact approximation factor is still unresolved is VERTEX COVER. PCP-based techniques of Dinur and Sa...
متن کاملIntegrality gaps of semidefinite programs for Vertex Cover and relations to ℓ1 embeddability of Negative Type metrics
We study various SDP formulations for Vertex Cover by adding different constraints to the standard formulation. We rule out approximations better than 2 − O( p log logn/ logn) even when we add the so-called pentagonal inequality constraints to the standard SDP formulation, and thus almost meet the best upper bound known due to Karakostas, of 2 − Ω( p 1/ logn). We further show the surprising fac...
متن کاملIntegrality Gaps of Semidefinite Programs for Vertex Cover and Relations to l1 Embeddability of Negative Type Metrics
We study various SDP formulations for Vertex Cover by adding different constraints to the standard formulation. We show that Vertex Cover cannot be approximated better than 2 − o(1) even when we add the so called pentagonal inequality constraints to the standard SDP formulation, en route answering an open question of Karakostas [14]. We further show the surprising fact that by strengthening the...
متن کاملIntegrality gaps of semidefinite programs for Vertex Cover and relations to $\ell_1$ embeddability of Negative Type metrics
We study various SDP formulations for Vertex Cover by adding different constraints to the standard formulation. We show that Vertex Cover cannot be approximated better than 2 − o(1) even when we add the so called pentagonal inequality constraints to the standard SDP formulation, en route answering an open question of Karakostas [14]. We further show the surprising fact that by strengthening the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010